Home » Fiche   membre
Fiche   membre Retour à l'annuaire  

Irena RUSU-ROBINI

ENSEIGNANT-CHERCHEUR

Professeur
HDR

: Irena.Rusuatls2n.fr

Page pro : http://pagesperso.ls2n.fr/~rusu-robini-i/

Adresse :

Université de Nantes - faculté des Sciences et Techniques ( FST )
Petit Port
2 Chemin de la Houssinière
BP 92208
44322 Nantes Cedex 3

Batiment 34, étage 3, bureau 303


Publications référencées sur HAL

Revues internationales avec comité de lecture (ART_INT)

    • [2] I. Rusu. Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT. In Theoretical Computer Science ; éd. Elsevier, 2019, vol. 771.
      https://hal.science/hal-02464917v1
    • [3] G. Fertin, I. Rusu, S. Vialette. The S-labeling problem: An algorithmic tour. In Discrete Applied Mathematics ; éd. Elsevier, 2018, vol. 246.
      https://hal.science/hal-01710032v1
    • [4] L. Pelletier, I. Rusu. Common intervals and permutation reconstruction from MinMax -betweenness constraints. In Journal of Discrete Algorithms ; éd. Elsevier, 2018, vol. 49.
      https://hal.science/hal-01983336v1
    • [5] I. Rusu. Sorting signed permutations by reversals using link-cut trees. In Information Processing Letters ; éd. Elsevier, 2018, vol. 132.
      https://hal.science/hal-01983332v1
    • [6] I. Rusu. log-Lists and their applications to sorting by transpositions, reversals and block-interchanges. In Theoretical Computer Science ; éd. Elsevier, 2017, vol. 660.
      https://hal.science/hal-01708351v1
    • [7] I. Rusu. Graph matching problems and the NP-hardness of sortedness constraints. In Theoretical Computer Science ; éd. Elsevier, 2017, vol. 695.
      https://hal.science/hal-01708356v1
    • [8] I. Rusu. Permutation reconstruction from MinMax-Betweenness constraints. In Discrete Applied Mathematics ; éd. Elsevier, 2016, vol. 207.
      https://hal.science/hal-02464904v1
    • [9] G. Fertin, H. Mohamed-Babou, I. Rusu. Path-Driven Orientation of Mixed Graphs. In Discrete Applied Mathematics ; éd. Elsevier, 2015, vol. 181.
      https://hal.science/hal-01044921v1
    • [10] L. Bulteau, G. Fertin, I. Rusu. Pancake Flipping Is Hard. In Journal of Computer and System Sciences ; éd. Elsevier, 2015, vol. 81, num. 8.
      https://hal.science/hal-01053461v1
    • [11] G. Fertin, G. Jean, A. Radulescu, I. Rusu. Hybrid de novo tandem repeat detection using short and long reads. In BMC Medical Genomics ; éd. BioMed Central, 2015, vol. 8, num. Suppl 3.
      https://hal.science/hal-01214038v1
    • [12] G. Fertin, C. Komusiewicz, H. Mohamed-Babou, I. Rusu. Finding Supported Paths in Heterogeneous Networks. In Algorithms ; éd. MDPI, 2015.
      https://hal.science/hal-01214037v1
    • [13] F. de Montgolfier, M. Raffinot, I. Rusu. Easy identification of generalized common and conserved nested intervals. In Journal of Computational Biology ; éd. Mary Ann Liebert, 2014, vol. 21, num. 7.
      https://hal.science/hal-00921762v1
    • [14] I. Rusu. MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations. In Theoretical Computer Science ; éd. Elsevier, 2013, vol. 543.
      https://hal.science/hal-01071343v1
    • [15] L. Bulteau, G. Fertin, I. Rusu. Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science. In Theoretical Computer Science ; éd. Elsevier, 2013, vol. 494.
      https://hal.science/hal-00826880v1
    • [16] L. Bulteau, G. Fertin, I. Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. In Journal of Discrete Algorithms ; éd. Elsevier, 2013, vol. 19.
      https://hal.science/hal-00826876v1
    • [17] I. Rusu. New applications of interval generators to genome comparison. In Journal of Discrete Algorithms ; éd. Elsevier, 2012, vol. 10.
      https://hal.science/hal-01071349v1
    • [18] L. Bulteau, G. Fertin, M. Jiang, I. Rusu. Tractability and approximability of maximal strip recovery. In Theoretical Computer Science ; éd. Elsevier, 2012, vol. 440-441.
      https://hal.science/hal-00700598v1
    • [19] L. Bulteau, G. Fertin, I. Rusu. Sorting by Transpositions is Difficult. In SIAM Journal on Discrete Mathematics ; éd. Society for Industrial and Applied Mathematics, 2012, vol. 26, num. 3.
      https://hal.science/hal-00826867v1
    • [20] J. Bourdon, I. Rusu. Statistical Properties of Factor Oracles. In Journal of Discrete Algorithms ; éd. Elsevier, 2010, vol. 9, num. 2011.
      https://hal.science/hal-00415952v1
    • [21] S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, S. Vialette. On the Approximability of Comparing Genomes with Duplicates. In Journal of Graph Algorithms and Applications ; éd. Brown University, 2009, vol. 13, num. 1.
      https://hal.science/hal-00416440v1
    • [22] G. del Mondo, D. Eveillard, I. Rusu. Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions. In Bioinformatics ; éd. Oxford University Press (OUP), 2009, vol. 25, num. 7.
      https://hal.science/hal-02352007v1
    • [23] G. del Mondo, D. Eveillard, I. Rusu. Homogeneous decomposition of protein interaction networks: refining the description of intra-modular interactions.. In Bioinformatics ; éd. Oxford University Press (OUP), 2009, vol. 25, num. 7.
      https://hal.science/hal-00415905v1
    • [24] F. Roussel, I. Rusu, H. Thuillier. The Strong Perfect Graph Conjecture: 40 years of Attempts, and its Resolution. In Discrete Mathematics ; éd. Elsevier, 2009, vol. 309, num. 20.
      https://inria.hal.science/inria-00475637v1
    • [25] I. Rusu. Converting suffix trees into factor/suffix oracles. In Journal of Discrete Algorithms ; éd. Elsevier, 2008, vol. 6, num. 2.
      https://hal.science/hal-00419899v1
    • [27] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes. In Journal of Computational Biology ; éd. Mary Ann Liebert, 2008, vol. 15, num. 8.
      https://hal.science/hal-00416446v1
    • [28] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. A General Framework for Computing Rearrangement Distances between Genomes with Duplicates. In Journal of Computational Biology ; éd. Mary Ann Liebert, 2007, vol. 14, num. 4.
      https://hal.science/hal-00417735v1
    • [29] C. Moan, I. Rusu. Hard problems in similarity searching. In Discrete Applied Mathematics ; éd. Elsevier, 2004, vol. 144, num. 1-2.
      https://hal.science/hal-00455436v1

Revues nationales avec comité de lecture (ART_NAT)

    • [30] I. Parfenoff, F. Roussel, I. Rusu. Loose vertices in C_4-free Berge graphs. In Discrete Mathematics ; éd. Elsevier, 2002, vol. 258.
      https://hal.science/hal-00442408v1
    • [32] V. Chvâtal, I. Rusu, R. Sritharan. Dirac-type characterizations of graphs without long chordless cycles. In Discrete Mathematics ; éd. Elsevier, 2002, vol. 256.
      https://hal.science/hal-00442423v1
    • [34] I. Rusu, J. Spinrad. Domination graphs: examples and counterexamples. In Discrete Applied Mathematics ; éd. Elsevier, 2001, vol. 110.
      https://hal.science/hal-00442416v1
    • [35] F. Roussel, I. Rusu. Recognizing i-triangulated graphs in O(mn) time. In Information Processing Letters ; éd. Elsevier, 2000, vol. 76.
      https://hal.science/hal-00442410v1
    • [37] F. Roussel, I. Rusu. Holes and dominoes in Meyniel graphs. In International Journal of Foundations of Computer Science ; éd. World Scientific Publishing, 1999, vol. 10, num. 2.
      https://hal.science/hal-00442411v1

Conférences internationales avec comité de lecture et actes (COMM_INT)

    • [40] D. Dumez, X. Gandibleux, I. Rusu. Datastructures for Filtering and Storing Non-Dominated Points. In MOPGP'17 :The 12th International Conference on Multiple Objective Programming and Goal Programming, octobre 2017, Metz, France.
      https://hal.science/hal-02492921v1
    • [41] L. Bulteau, G. Fertin, A. Labarre, R. Rizzi, I. Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three. In The 22nd International Computing and Combinatorics Conference (COCOON), août 2016, Ho Chi Minh City, Viêt Nam.
      https://hal.science/hal-01309152v1
    • [42] G. Fertin, I. Rusu, S. Vialette. Algorithmic aspects of the S-Labeling problem. In 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), octobre 2015, Verona, Italie.
      https://hal.science/hal-01311584v1
    • [43] G. Fertin, I. Rusu, S. Vialette. Obtaining a Triangular Matrix by Independent Row-Column Permutations. In 26th International Symposium on Algorithms and Computation, décembre 2015, Nagoya, France.
      https://hal.science/hal-01189621v1
    • [44] G. Fertin, G. Jean, A. Radulescu, I. Rusu. DExTaR: Detection of Exact Tandem Repeats based on the de Bruijn graph. In IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2014), novembre 2014, Belfast, Irlande.
      https://hal.science/hal-01117967v1
    • [45] L. Bulteau, G. Fertin, C. Komusiewicz, I. Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. In 13th Workshop on Algorithms in Bioinformatics (WABI2013), septembre 2013, Nice, France.In Springer (éds.), . , 2013.
      https://hal.science/hal-00906903v1
    • [46] G. Fertin, H. Mohamed-Babou, I. Rusu. Algorithms for subnetwork mining in heterogeneous networks. In 11th Symposium on Experimental Algorithms (SEA 2012), juin 2012, Bordeaux, France.
      https://hal.science/hal-00689889v1
    • [47] L. Bulteau, G. Fertin, I. Rusu. Pancake Flipping is Hard. In 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), août 2012, Bratislava, Slovaquie.In Springer Verlag (éds.), . , 2012.
      https://hal.science/hal-00717712v1
    • [48] G. Blin, G. Fertin, H. Mohamed-Babou, I. Rusu, F. Sikora, S. Vialette. Algorithmic Aspects of Heterogeneous Biological Networks Comparison. In COCOA 2011, 2011, Zhangjiajie, Chine.
      https://hal.science/hal-00606375v1
    • [49] L. Bulteau, G. Fertin, I. Rusu. Sorting by Transpositions is Difficult. In 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Suisse.
      https://hal.science/hal-00606223v1
    • [50] L. Bulteau, G. Fertin, M. Jiang, I. Rusu. Tractability and Approximability of Maximal Strip Recovery. In 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italie.
      https://hal.science/hal-00606167v1
    • [51] P. Bordron, D. Eveillard, I. Rusu. SIPPER: A flexible method to integrate heterogeneous data into a metabolic network. In Computational Advances in Bio and Medical Sciences (ICCABS), 2011 IEEE 1st International Conference on, février 2011, Orlando, états-Unis.
      https://hal.science/hal-00585102v1
    • [52] S. Angibaud, P. Bordron, D. Eveillard, G. Fertin, I. Rusu. Integration of omics data to investigate common intervals. In 1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), 2011, Singapore, Singapour.In IEEE (éds.), Proc. 1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011). , 2011.
      https://hal.science/hal-00606226v1
    • [53] L. Bulteau, G. Fertin, I. Rusu. Revisiting the Minimum Breakpoint Linearization Problem. In 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), juin 2010, Prague, France.
      https://hal.science/hal-00482856v1
    • [54] F. Cliquet, G. Fertin, I. Rusu, D. Tessier. Proper Alignment of MS/MS Spectra from Unsequenced Species. In 11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), septembre 2010, Las Vegas, états-Unis.
      https://hal.science/hal-01068873v1
    • [55] L. Bulteau, G. Fertin, I. Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. In ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, états-Unis.
      https://hal.science/hal-00425145v1
    • [56] F. Cliquet, G. Fertin, I. Rusu, D. Tessier. Comparison of Spectra in Unsequenced Species. In 4th Brazilian Symposium on Bioinformatics (BSB 2009), 2009, Porto Alegre, Brésil.In Springer-Verlag (éds.), In Proc. 4th Brazilian Symposium on Bioinformatics (BSB 2009). Springer-Verlag, 2009.
      https://hal.science/hal-00416462v1
    • [57] S. Angibaud, D. Eveillard, G. Fertin, I. Rusu. Comparing Bacterial Genomes by Searching their Common Intervals. In 1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), 2009, New Orleans, états-Unis.In Springer-Verlag (éds.), . Springer-Verlag, 2009.
      https://hal.science/hal-00416466v1
    • [58] S. Angibaud, G. Fertin, I. Rusu. On the Approximability of Comparing Genomes with Duplicates. In 2nd Workshop on Algorithms and Computation (WALCOM 2008), 2008, Dhaka, Bangladesh.In Springer-Verlag (éds.), In Proc. 2nd Workshop on Algorithms and Computation (WALCOM 2008). Springer-Verlag, 2008.
      https://hal.science/hal-00416492v1
    • [59] S. Angibaud, G. Fertin, I. Rusu, A. Thevenin, S. Vialette. A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. In 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, états-Unis.
      https://hal.science/hal-00417902v1
    • [60] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation. In 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada.
      https://hal.science/hal-00418258v1
    • [61] G. Blin, G. Fertin, I. Rusu, C. Sinoquet. Extending the Hardness of RNA Secondary Structure Comparison. In 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), avril 2007, Hangzhou, Chine.In Chen Bo and Paterson Mike and Zhang Guochuan (éds.), Proc. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007). Springer-Verlag, 2007.
      https://hal.science/hal-00418248v1
    • [62] S. Angibaud, G. Fertin, I. Rusu, S. Vialette. How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. In 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada.
      https://hal.science/hal-00619848v1
    • [63] A. Mancheron, I. Rusu. Pattern discovery allowing gaps, substitution matrices and multiple score functions. In Workshop on Algorithms in BioInformatics (WABI), septembre 2003, Budapest, Hongrie.In Gary BENSON and Roderic PAGE (éds.), Algorithms in Bioinformatics. Proceedings of the 3rd International Workshop on Algorithms in BioInformatics (WABI). Springer-Verlag, 2003.
      https://hal.science/hal-00487245v1

Conférences nationales avec comité de lecture et actes (COMM_NAT)

    • [64] G. Fertin, H. Mohamed-Babou, I. Rusu. On the Complexity of two Problems on Orientations of Mixed Graphs. In In Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), juillet 2012, Rennes, France.
      https://hal.science/hal-00826863v1

Ouvrages - Chapitres d‘ouvrages et directions d‘ouvrages (OUV)

    • [65] G. Jean, A. Radulescu, I. Rusu. The Contig Assembly Problem and Its Algorithmic Solutions. In Algorithms for Next-Generation Sequencing Data, pp. 267-298. 2017
      https://hal.science/hal-01819204v1
    • [66] G. Fertin, I. Rusu. Computing Genomic Distances: An Algorihtmic Viewpoint. In Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. 2011
      https://hal.science/hal-00606146v1
Copyright : LS2N 2017 - Mentions Légales - 
 -